On Meta { Programming in CLP ( < )

نویسندگان

  • Peter Stuckey
  • Roland Yap
چکیده

The manipulation of CLP(<) programs in CLP(<) is severely limited, since equality for this language is not based on the syntactic structure of terms. We propose an extended language, CLP(< + M), which provides a basis for (a) coding terms in a form which allows arbitrary structural manipulation, and (b) converting between terms and their coded forms. Importantly, CLP(<+ M) may not only be used as a metalanguage for CLP(<), but also as its own metalanguage. Building on this extended language we propose an integrated set of system predicates for practical meta-programming.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Meta Constraint Logic Programming Scheme

We present a Meta Constraint Logic Programming (MCLP) general scheme. The idea behind the work concerns the possibility of building meta CLP architectures by adding CLP solvers as meta level reasoners on the constraints of the underlying object systems. In this way, we are able not only to increase the expressive power of CLP, but also to implement several constraint satisfaction techniques lik...

متن کامل

Meta-Programming in CLP(R)

A widely used property of Prolog is that it is possible to write Prolog programs to construct and manipulate other Prolog programs in a very general manner. Unfortunately , this property is not carried over to richer languages such as CLP(R) { the manipulation of CLP(R) programs in CLP(R) is quite limited. The reason is that the equality of terms in CLP(R) is not based on their syntactic struct...

متن کامل

CLP(PB), A Meta-Interpreter in CLP(R)

Constraint logic programming is one of the most attractive research areas in logic programming. Due to [JL87] the theoretical foundation of a general constraint logic programming language scheme CLP(X ) is available. Unfortunately, implementing a CLP(X ) system for some domain X is a difficult task. The problematic points are providing a constraint solver and ensuring the incrementality of the ...

متن کامل

Integration of Abductive Reasoning and Constraint Optimization in SCIFF

Abductive Logic Programming (ALP) and Constraint Logic Programming (CLP) share the feature to constrain the set of possible solutions to a program via integrity or CLP constraints. These two frameworks have been merged in works by various authors, who developed efficient abductive proof-procedures empowered with constraint satisfaction techniques. However, while almost all CLP languages provide...

متن کامل

A new method for solving fully fuzzy linear Bilevel programming problems

In this paper, a new method is proposed to find the fuzzy optimal solution of fully fuzzy linear Bilevel programming (FFLBLP) problems by representing all the parameters as triangular fuzzy numbers. In the proposed method, the given FFLBLP problem is decomposed into three crisp linear programming (CLP) problems with bounded variables constraints, the three CLP problems are solved separately...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1989